Strengthened semidefinite programming bounds for codes
نویسندگان
چکیده
منابع مشابه
Strengthened semidefinite programming bounds for codes
We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte ...
متن کاملBounds for projective codes from semidefinite programming
We apply the semidefinite programming method to derive bounds for projective codes over a finite field.
متن کاملBounds for Codes by Semidefinite Programming
Delsarte’s method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that using as variables power sums of distances this problem can be considered as a finite semidefinite programming problem. This method allows to improve some l...
متن کاملSemidefinite programming for permutation codes
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym(n). In particular, we compute orbits of ordered pairs on Sym(n) acted upon by conjugation and inversion, explore a block di-agonalization of the associated algebra, and obtain improved upper bounds on the size M (n, d) of permutation codes of lengths u...
متن کاملStrengthened Semidefinite Programming Relaxations for the Max-cut Problem
In this paper we summarize recent results on finding tight semidefinite programming relaxations for the Max-Cut problem and hence tight upper bounds on its optimal value. Our results hold for every instance of Max-Cut and in particular we make no assumptions on the edge weights. We present two strengthenings of the well-known semidefinite programming relaxation of Max-Cut studied by Goemans and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2006
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-006-0030-3